A quantum secret sharing scheme with verifiable function
نویسندگان
چکیده
منابع مشابه
A Verifiable Threshold Quantum Secret Sharing Scheme Using Interpolation Method
Verifiable secret sharing schemes are important in cloud computing environments. Thus a key can be distributed over many servers by threshold secret sharing mechanism. The key is then reconstructed when needed. Secret sharing has also been suggested for sensor networks where the links are liable to be tapped by sending the data in shares which makes the task of the eavesdropper harder. The secu...
متن کاملA practical verifiable multi-secret sharing scheme
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed an efficient multi-secret sharing scheme based on a two-variable one-way function in 2004. But the scheme doesn't have the property of verification. A practical verifiable multi-secret sharing scheme, which is based on ...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملUnconditionally Secure Verifiable Secret Sharing Scheme
Abstract A (t, n) secret sharing scheme permits a secret to be divided into n shares in such a way that any t or more than t shares can reconstruct the secret, but fewer than t shares cannot reconstruct the secret. Verifiable secret sharing (VSS) has been proposed to allow each shareholder to verify the validity of his own share, but not other shareholders' shares. In this paper, we propose an ...
متن کاملA Verifiable Secret Sharing Scheme with Statistical zero-knowledge
In this paper, we first propose a protocol in which the prover can show that a = b holds for two committed integers a and b; also, we present a protocol in which the prover can prove that a 6= 0 holds for committed integer a; then, we construct a protocol to prove that the degree of a polynomial f(x) equals to t− 1 exactly, which has been as an open problem(see[21]); finally, we provide a proto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal D
سال: 2020
ISSN: 1434-6060,1434-6079
DOI: 10.1140/epjd/e2020-10010-3